Computing sparse permanents faster
نویسندگان
چکیده
Bax and Franklin (2002) gave a randomized algorithm for exactly computing the permanent of any n × n zero-one matrix in expected time exp [
منابع مشابه
A load balancing strategy for parallel computation of sparse permanents
The research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-increasing order of processing times. In this paper, we find that the time spending for computing the permanent of a sparse matrix by hybrid algorithm is strongly correlated to its permanent value. A strategy is introduce...
متن کاملA partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
A partially structure-preserving method for sparse symmetric matrices is proposed. Computational results on the permanents of adjacency matrices arising from molecular chemistry are presented. The largest adjacency matrix of fullerenes computed before is that of C60 with a cost of several hours on supercomputers, while only about 6 min on an Intel Pentium PC (1.8 GHz) with our method. Further n...
متن کاملAn efficient tree decomposition method for permanents and mixed discriminants
We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we assume that its treewidth, denoted as ω, is small. Our algorithm requires Õ(n 2) arithmetic operations to compute permanents, and Õ(n + n 3) for mixed discrimina...
متن کاملA hybrid algorithm for computing permanents of sparse matrices
The permanent of matrices has wide applications in many fields of science and engineering. It is, however, a #P-complete problem in counting. The best-known algorithm for computing the permanent, which is due to Ryser [Combinatorial Mathematics, The Carus Mathematical Monographs, vol. 14, Mathematical Association of America, Washington, DC, 1963], runs O(n2 ) in time. It is possible to speed up...
متن کاملOn the Permanent of Certain Circulant Matrices
In this paper we rst review the basic computational properties of per-manents, and then address some problems concerning permanents of (0; 1) circulant matrices. In particular we analyze their role at the boundary between computational tractability and intractability, showing that (i) a generic circulant matrix contains large arbitrary submatrices, a fact which casts some doubt on the tractabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 96 شماره
صفحات -
تاریخ انتشار 2005